SOLVING THE POLYTECHNIC CLASS SCHEDULING PROBLEM USING INTEGER LINEAR PROGRAMMING MODEL

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the Installation Scheduling Problem Using Mixed Integer Linear Programming

for installing a large number of sizes and types of items (e.g., machines) over time so as to optimize some measure (e.g., initial capital investment), subject to various resource constraints. Examples of this problem are scheduling the installation of point-of-sale terminals in supermarket and retail chains, and teller terminals in banks. We have formulated the installation scheduling problem ...

متن کامل

Solving fully fuzzy Linear Programming Problem using Breaking Points

Abstract In this paper we have investigated a fuzzy linear programming problem with fuzzy quantities which are LR triangular fuzzy numbers. The given linear programming problem is rearranged according to the satisfactory level of constraints using breaking point method. By considering the constraints, the arranged problem has been investigated for all optimal solutions connected with satisf...

متن کامل

A reduced integer programming model for the ferry scheduling problem

We present an integer programming model for the ferry scheduling problem, improving existing models in various ways. In particular, our model has reduced size in terms of the number of variables and constraints compared to existing models by a factor of approximately O(n), where n being the number of ports. The model also handles efficiently load/unload time constraints, crew scheduling and pas...

متن کامل

Solving the single-machine sequencing problem using integer programming

Various integer programming models have been proposed for sequencing problems. However, little is known about the practical value of these models. This paper reports a comparison of six different integer programming formulations of the single-machine total tardiness problem. We created a set of especially difficult test problems and attempted to solve them with each of the formulations, using C...

متن کامل

Solving a mixed-integer linear programming model for a multi-skilled project scheduling problem by simulated annealing

Article history: Received July 20, 2011 Received in Revised form October, 12, 2011 Accepted 15 October 2011 Available online 20 October 2011 A multi-skilled project scheduling problem (MSPSP) has been generally presented to schedule a project with staff members as resources. Each activity in project network requires different skills and also staff members have different skills, too. This causes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: INTERNATIONAL JOURNAL OF COMPUTER APPLICATION

سال: 2020

ISSN: 2250-1797

DOI: 10.26808/rs.ca.i10v5.02